A Class of Interconnection Networks for Multicasting
نویسنده
چکیده
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicast connections between the network inputs and network outputs. However, due to the complex communication patterns and routing control in multicast networks, there is still a considerably large gap in network cost between the currently best known multicast networks and permutation networks. In this paper, we will present a class of interconnection networks which can support a substantial amount of well-defined multicast patterns in a nonblocking fashion and yet have a comparable cost to permutation networks. We will also provide an efficient routing algorithm for satisfying multicast connection requests in such networks. Moreover, the multicast capability of the networks will be represented as a function of fundamental network structural parameters so that the trade-off between the network multicast capability and the network cost can be determined.
منابع مشابه
An Euler Path Based Technique for Deadlock-free Multicasting
The existing algorithms for deadlock-free multicasting in interconnection networks assume the Hamiltonian property in the networks topology. However, these networks fail to be Hamiltonian in the presence of faults. This paper investigates the use of Euler circuits in deadlock-free multicasting. Not only are Euler circuits known to exist in all connected networks, a fast polynomial-time algorith...
متن کاملFault-Tolerant Multicasting in Multistage Interconnection Networks
In this paper, we study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerance multicasting, which employs the restricted header encoding...
متن کاملTree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks
In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks. We rst analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asyn-chronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The se...
متن کاملInvestigating Multicasting Traffic in Multistage Interconnection Networks with MOSEL∗
Multistage interconnection networks (Banyan networks) are frequently used for performance evaluation of communication systems (e.g. Ethernet and ATM switches). There exist several studies (see [9] and [7]) describing the performance of networks in which packets (or frames) are unicasted (i.e. one switching element (SE) sends the packet to one and only one other SE). A model for MINs in case of ...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملTree-based Multicasting on Wormhole Routed Multistage Interconnection Networks 1
Multicast operation is an important operation in multicomputer communication systems and can be used to support several other collective communication operations. A signi cant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose a tree based multicasting algorithm for Multistage Interconnection Networks (MIN). We rst analyze...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Computers
دوره 47 شماره
صفحات -
تاریخ انتشار 1996